-
1 коэффициент инцидентности
матрица инцидентности; матрица инциденций — incidence matrix
Русско-английский новый политехнический словарь > коэффициент инцидентности
-
2 матрица инцидентности
1. vertex-edge incidence matrixматрица инцидентности; матрица инциденций — incidence matrix
2. incidence matrixРусско-английский большой базовый словарь > матрица инцидентности
-
3 матрица инциденций
1) Information technology: incidence matrix, vertex-edge incidence matrix2) Makarov: incidence matrix (инцидентности)Универсальный русско-английский словарь > матрица инциденций
-
4 матрица инцидентности
1) Engineering: incidence matrix2) Mathematics: adjacency matrix3) Information technology: incident matrix4) Graph theory: vertex-edge incidence matrix5) Makarov: connectivity matrixУниверсальный русско-английский словарь > матрица инцидентности
-
5 матрица инциденций
1. vertex-edge incidence matrix2. incidence matrixРусско-английский большой базовый словарь > матрица инциденций
-
6 матрица инцидентности вершин и рёбер
Mathematics: vertex-edge incidence matrixУниверсальный русско-английский словарь > матрица инцидентности вершин и рёбер
См. также в других словарях:
Incidence matrix — In mathematics, an incidence matrix is a matrix that shows the relationship between two classes of objects. If the first class is X and the second is Y, the matrix has one row for each element of X and one column for each element of Y. The entry… … Wikipedia
Incidence structure — In combinatorial mathematics, an incidence structure is a triple :C=(P,L,I)., where P is a set of points , L is a set of lines and I subseteq P imes L is the incidence relation. The elements of I are called flags. If :(p,ell) in I,we say that… … Wikipedia
Edge space — In the mathematical discipline of graph theory, the edge space and vertex space of an undirected graph are vector spaces defined in terms of the edge and vertex sets, respectively. These vector spaces make it possible to use techniques of linear… … Wikipedia
Adjacency matrix — In mathematics and computer science, an adjacency matrix is a means of representing which vertices (or nodes) of a graph are adjacent to which other vertices. Another matrix representation for a graph is the incidence matrix. Specifically, the… … Wikipedia
Signed graph — In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign.Formally, a signed graph Sigma; is a pair ( G , sigma;) that consists of a graph G = ( V , E ) and a sign mapping or… … Wikipedia
Hypergraph — An example hypergraph, with X = {v1,v2,v3,v4,v5,v6,v7} and E = {e1,e2,e3,e4} = {{v1,v2,v3}, {v2,v3} … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Kirchhoff's theorem — In the mathematical field of graph theory Kirchhoff s theorem or Kirchhoff s matrix tree theorem named after Gustav Kirchhoff is a theorem about the number of spanning trees in a graph. It is a generalization of Cayley s formula which provides… … Wikipedia
Duality (mathematics) — In mathematics, a duality, generally speaking, translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one to one fashion, often (but not always) by means of an involution operation: if the dual… … Wikipedia
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia
List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 … Wikipedia